منابع مشابه
A Polynomial time Jacobi Method for Lattice Basis Reduction
Among all lattice reduction algorithms, the LLL algorithm is the first and perhaps the most famous polynomial time algorithm, and it is widely used in many applications. In 2012, S. Qiao [24] introduced another algorithm, the Jacobi method, for lattice basis reduction. S. Qiao and Z. Tian [25] improved the Jacobi method further to be polynomial time but only produces a Quasi-Reduced basis. In t...
متن کاملPolynomial Reduction
Let n be an ordinal number and let R be a non trivial zero structure. One can verify that there exists a monomial of n, R which is non-zero. Let us observe that there exists a field which is non trivial. Let us note that every left zeroed add-right-cancelable right distributive left unital commutative associative non empty double loop structure which is fieldlike is also integral domain-like. L...
متن کاملModel reduction in H2 using matrix solutions of polynomial equations
A method is given for solving an optimal H2 approximation problem for SISO linear time-invariant stable systems. The method guarantees that the global optimum is found. It is based on constructive algebra, but compared with earlier results, the method has much smaller time and memory requirements, and can therefore be applied to systems of significantly higher McMillan degree. The use of Buchbe...
متن کاملA Balancing Approach to Model Reduction of Polynomial Nonlinear Systems
This paper considers a computational approach to obtain a reduced order model for polynomial nonlinear systems. The approach is based on balancing generalized gramians of polynomial systems and truncating the systems based on the balanced generalized gramians. The approach utilizes sum of squares programming for its computational purposes.
متن کاملEfficient polynomial reduction
H–bases are bases for polynomial ideals, characterized by the fact that their homogeneous leading terms are a basis for the associated homogeneous ideal. In the computation of H–bases without term orders, an important task is to determine the orthogonal projection of a homogeneous polynomial to certain subspaces of homogeneous polynomials with respect to a given inner product. One way of doing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1992
ISSN: 0895-7177
DOI: 10.1016/0895-7177(92)90025-g